Description: 程序可以很好的实现在原图的基础之上挖出下图和用来进行匹配的模板-procedures can be very good at achieving maximum dug up the foundation under the plan and used for the template matching Platform: |
Size: 74616 |
Author:宋成军 |
Hits:
Description: 图像匹配的的原图和目标图片，很实用的，欢迎下寨-image matching the maximum and objectives of the pictures, very practical and welcome Xiaqian Platform: |
Size: 60535 |
Author:王世平 |
Hits:
Description: Prediction by partial matching, or PPM, is a finite context statistical modeling technique that can be viewed as blending together several fixed order context models to predict the next character in the input sequence. Prediction probabilities for each context in the model are calculated from frequency counts which are updated adaptively and the symbol that actually occurs is encoded relative to its predicted distribution using arithmetic coding. The maximum context length is a fixed constant, and it has been found that increasing it beyond about six or so does not generally improve compression. -Prediction by partial matching, or PPM. is a finite Platform: |
Size: 47725 |
Author:陈伯 |
Hits:
Description: 在灰度变换里涉及到灰度变换处理，窗口变换处理，分段线性变换处理，灰度分析均衡化处理，灰度匹配处理；投影法中涉及到水平投影和纯直投影；直方图显示中涉及到原图直方图，变换后直方图，及其R、G、B直方图统计等，是入门的不错的选择，值得-in gray transform Lane involving gray transform, the window transform, piecewise linear transformation, Analysis of gray balance, matching gray; projection method involved the level of pure projection and direct projection; histogram shows that relate to the maximum histogram, transformed histogram, and the R, G, B Histogram statistics. The portal is a good choice, it is worth a look at Platform: |
Size: 353177 |
Author:wzt |
Hits:
Description: 图像匹配的的原图和目标图片，很实用的，欢迎下寨-image matching the maximum and objectives of the pictures, very practical and welcome Xiaqian Platform: |
Size: 433064 |
Author:wewewe |
Hits:
Description: 程序可以很好的实现在原图的基础之上挖出下图和用来进行匹配的模板-procedures can be very good at achieving maximum dug up the foundation under the plan and used for the template matching Platform: |
Size: 1648640 |
Author:宋成军 |
Hits:
Description: 图像匹配的的原图和目标图片，很实用的，欢迎下寨-image matching the maximum and objectives of the pictures, very practical and welcome Xiaqian Platform: |
Size: 60416 |
Author:王世平 |
Hits:
Description: Prediction by partial matching, or PPM, is a finite context statistical modeling technique that can be viewed as blending together several fixed order context models to predict the next character in the input sequence. Prediction probabilities for each context in the model are calculated from frequency counts which are updated adaptively and the symbol that actually occurs is encoded relative to its predicted distribution using arithmetic coding. The maximum context length is a fixed constant, and it has been found that increasing it beyond about six or so does not generally improve compression. -Prediction by partial matching, or PPM. is a finite Platform: |
Size: 47104 |
Author:陈伯 |
Hits:
Description: 这是一个web搜索的基本程序，从命令行输入搜索条件（起始的URL、处理url的最大数、要搜索的字符串),
它就会逐个对Internet上的URL进行实时搜索,查找并输出匹配搜索条件的页面。 这个程序的原型来自《java编程艺术》，
为了更好的分析，站长去掉了其中的GUI部分，并稍作修改以适用jdk1.5。以这个程序为基础，可以写出在互联网上搜索
诸如图像、邮件、网页下载之类的“爬虫”。-This is a web search for the basic procedures, from the command line enter the search terms (the start of the URL, the url handle the maximum number, to search for the string), it will by the URL on the Internet for real-time search, search and output pages matching your search criteria. Prototype of this process from the Platform: |
Size: 3072 |
Author:scc |
Hits:
Description: 可行点标记求最佳匹配算法的MATLAB 程序代码 求最小费用最大流算法的MATLAB 程序代码 匈牙利算法的MATLAB 程序代码 遗传算法解决TSP问题的Matlab程序 遗传算法解决非线性规划问题的Matlab程序 -Feasible point marking the best matching algorithm for the MATLAB code for the minimum cost maximum flow algorithm of the MATLAB program code Hungarian algorithm MATLAB code genetic algorithm to solve TSP problems Matlab procedures for genetic algorithm to solve nonlinear programming problems Matlab procedures Platform: |
Size: 119808 |
Author: |
Hits:
Description: 简介：基于词典逆向最大匹配法而实现的中文分离代码。
作用：可将一个汉字序列切分成一个一个单独的词。(Introduction: the Chinese separation code based on the dictionary reverse maximum matching method.
Function: a Chinese character sequence can be divided into a single word.) Platform: |
Size: 2048 |
Author:昔年种柳
|
Hits:
Description: 中文分词，采用逆向最大匹配方法实现，利用字典作为索引(The Chinese word segmentation is realized by the reverse maximum matching method, and the dictionary is used as the index.) Platform: |
Size: 1583104 |
Author:meizu |
Hits:
Description: 根据所给中文词典，对中文文本进行正向最大匹配分词，其中包括读取文本，并对其分词(According to the Chinese dictionary, the Chinese text is given a positive maximum matching word, which includes the reading of the text and the participle of the Chinese text.) Platform: |
Size: 165888 |
Author:weiyuyu |
Hits:
Description: 用双向最大匹配算法实现汉语分词。准确率颇高。(Two way maximum matching algorithm is used to realize Chinese word segmentation. The rate of accuracy is quite high.) Platform: |
Size: 1024 |
Author:feng4251 |
Hits:
Description: Were Tian Ji lives in nowadays, he will certainly laugh at himself. Even more, were he sitting in the ACM contest right now, he may discover that the horse racing problem can be simply viewed as finding the maximum matching in a bipartite graph. Draw Tian's horses on one side, and the king's horses on the other. Whenever one of Tian's horses can beat one from the king, we draw an edge between them, meaning we wish to establish this pair. Then, the problem of winning as many rounds as possible is just to find the maximum matching in this graph. If there are ties, the problem becomes more complicated, he needs to assign weights 0, 1, or -1 to all the possible edges, and find a maximum weighted perfect matching...(For each input case, output a line containing a single number, which is the maximum money Tian Ji will get, in silver dollars.) Platform: |
Size: 1024 |
Author:zilewwy |
Hits:
Description: 求二分图最大匹配可以用最大流或者匈牙利算法。
最大匹配 给定一个二分图G，在G的一个子图M中，M的边集中的任意两条边都不依附于同一个顶点，则称M是一个匹配. 选择这样的边数最大的子集称为图的最大匹配问题 如果一个匹配中，图中的每个顶点都和图中某条边相关联，则称此匹配为完全匹配，也称作完备匹配。(For maximum matching of two partite graphs, maximum flow or Hungarian algorithm can be used.
The maximum match is given a two partite graph G. In a subgraph M of G, any two edges of the edge of the M are not attached to the same vertex, then it is called a match. The subset of the largest number of the edges of the graph is called the maximum matching problem of the graph if each vertex in the graph is associated with a certain edge in the graph. This match is called complete matching, also known as complete matching.) Platform: |
Size: 1024 |
Author:magician- |
Hits:
Description: 如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.) Platform: |
Size: 4096 |
Author:throne1 |
Hits:
Description: 常用图论算法及其MATLAB程序代码：
1.最短路的Warshall-Floyd算法
2.最小生成树Kruskal避圈法
3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code:
1. shortest path Warshall-Floyd algorithm
2. minimum spanning tree Kruskal avoidance method
3. the maximum matching algorithm of the two part graph G (Hungary algorithm)) Platform: |
Size: 37888 |
Author:解码 |
Hits:
Description: KM算法可以计算二分图的最大权匹配，匈牙利算法可以计算最大匹配(KM algorithm can calculate the maximum weight matching of bipartite graphs, Hungary algorithm can calculate the maximum matching.) Platform: |
Size: 1024 |
Author:xxxlll32 |
Hits:
Search - maximum matching